A Variational Discretization Concept in Control Constrained Optimization: The Linear-Quadratic Case
نویسندگان
چکیده
منابع مشابه
A Variational Discretization Concept in Control Constrained Optimization: The Linear-Quadratic Case
A new discretization concept for optimal control problems with control constraints is introduced which utilizes for the discretization of the control variable the relation between adjoint state and control. Its key feature is not to discretize the space of admissible controls but to implicitly utilize the first order optimality conditions and the discretization of the state and adjoint equation...
متن کاملConstrained Linear Quadratic Regulator: Continuous-Time Case
This paper deals with the linear quadratic regulator with constraints on the state and the input vectors. Such an optimization problem has a wide applications in industry like chemical and manufacturing industries. Our goal in this paper consists of developing an efficient numerical algorithm to solve such problem. Our technique relays on an iterative approach that uses the solution of the stan...
متن کاملA polynomial case of the cardinality-constrained quadratic optimization problem
We investigate in this paper a fixed parameter polynomial algorithm for the cardinality constrained quadratic optimization problem, which is NP-hard in general. More specifically, we prove that, given a problem of size n, the number of decision variables, and s, the cardinality, if, for some 0 < k ≤ n, the n − k largest eigenvalues of the coefficient matrix of the problem are identical, we can ...
متن کاملFinding the Best Coefficients in the Objective Function of a Linear Quadratic Control Problem
Finding the best weights of the state variables and the control variables in the objective function of a linear-quadratic control problem is considered. The weights of these variables are considered as two diagonal matrices with appropriate size and so the objective function of the control problem becomes a function of the diagonal elements of these matrices. The optimization problem which is d...
متن کاملPreconditioning for Bound Constrained Quadratic Programming Problems Arising from Discretization of Variational Inequalities
The active set based MPRGP (modified proportioning with reduced gradient projection) [1] for the solution of partially bound constrained quadratic programming problems turned out to be an important ingredient in development of scalable algorithms for the solution of variational inequalities by FETI [3] and BETI [4] domain decomposition methods. The algorithm was proved to have R-linear rate of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2005
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-005-4559-5